Characterizing the strongly jump-traceable sets via randomness
نویسندگان
چکیده
منابع مشابه
Characterizing the Strongly Jump-traceable Sets via Randomness
We show that if a set A is computable from every superlow 1random set, then A is strongly jump-traceable. Together with a result of Greenberg and Nies (Benign cost functions and lowness properties, J. Symb. Logic 76 (1): 289-312, 2011), this theorem shows that the computably enumerable (c.e.) strongly jump-traceable sets are exactly the c.e. sets computable from every superlow 1-random set. We ...
متن کاملOn strongly jump traceable reals
In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables
متن کاملA random set which only computes strongly jump-traceable c.e. sets
We prove that there is a ∆2, 1-random set Y such that every computably enumerable set which is computable from Y is strongly jump-
متن کاملCharacterizing strong randomness via Martin-Löf randomness
We introduce two methods to characterize strong randomness notions via Martin-Löf randomness. By applying these methods, we investigate ∅′-Schnorr randomness.
متن کاملTraceable Sets
We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncomputable sets or complex and autocomplex sets. We review known notions and results that appear in the literature in different contexts, put them into perspective and provide simplified or at least more direct proofs. In addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2012
ISSN: 0001-8708
DOI: 10.1016/j.aim.2012.06.005